#include<iostream>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_set>
#include<bits/stdc++.h>
#define fi first
#define se second
#define SIZE(x) ((int)x.size())
#define out(x) cerr<<#x<<" = "<<(x)<<endl;
#define MP(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
#define VI vector<int>
#define VVI vector< vector<int> >
#define VC vector<char>
#define PI pair<int,int>
#define PL pair<ll,ll>
#define EPS 0.000001


inline int lson(int x){return x<<1;}
inline int rson(int x){return (x<<1)|1;}

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}

template<typename T> 
inline void read(T &x){
	x=0;T f=1;char ch;
	do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
	do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}


bool dat[100000005]={0};
int ss[1000005];
int main(){
    #ifdef BUG
    freopen("a.in","r",stdin);
    #endif
	int n=read(),m=read();
	int tot=1000000;
	int ind=1;
	dat[1]=1;
	for(int i=2;i<=n;i++){
		if(!dat[i])ss[ind++]=i;
		for(int j=1;j<=tot&&i*ss[j]<=n;j++){
			dat[i*ss[j]]=1;
			if(i%ss[j]==0)break;
		}
	}
	for(int i=0;i<m;i++){
		printf("%d\n",ss[read()]);
	}
}
